Bounded Model Checking for Partial Kripke Structures
نویسنده
چکیده
Partial Kripke structures model incomplete state spaces with unknown parts. The evaluation of temporal logic formulae on partial Kripke structures is thus based on three-valued interpretations; the additional truth value ⊥ stands for “unknown whether property true or false”. There are existing model checking algorithms as well as tools employing this three-valued interpretation. In this paper we study the applicability of bounded model checking techniques to partial Kripke structures. To this end, we generalise the translation of Kripke structure and temporal logic formula to propositional logic as to include the value ⊥, and define a new notion of satisfiability for propositional formulae containing ⊥ as constants. We show that a check for this kind of satisfiability can be reduced to two checks for ordinary two-valued satisfiability, thus allowing for the use of standard SAT solvers.
منابع مشابه
Adapting Biochemical Kripke Structures for Distributed Model Checking
In this paper, we use some observations on the nature of biochemical reactions to derive interesting properties of qualitative biochemical Kripke structures. We show that these characteristics make Kripke structures of biochemical pathways suitable for assumption based distributed model checking. The number of chemical species participating in a biochemical reaction is usually bounded by a smal...
متن کاملOn Model Checking Durational Kripke Structures
We consider quantitative model checking in durational Kripke structures (Kripke structures where transitions have integer durations) with timed temporal logics where subscripts put quantitative constraints on the time it takes before a property is satisfied. We investigate the conditions that allow polynomial-time model checking algorithms for timed versions of CTL and exhibit an important gap ...
متن کاملProving∀μ -Calculus Properties with SAT-Based Model Checking
In this paper, we present a complete bounded model checking algorithm for the universal fragment of μ-calculus. The new algorithm checks the completeness of bounded proof of each property on the fly and does not depend on prior knowledge of the completeness thresholds. The key is to combine both local and bounded model checking techniques and use SAT solvers to perform local model checking on f...
متن کاملModel checking finite paths and trees
This thesis presents efficient parallel algorithms for checking temporal logic formulas over finite paths and trees. We show that LTL path checking is in AC(logDCFL) and CTL tree checking is in AC(logDCFL). For LTL with pasttime and bounded modalities, which is an exponentially more succinct logic, we show that the path checking problem remains in AC(logDCFL). Our results provide a foundation f...
متن کاملSelected Methods of Model Checking using SAT
The objectives of this research are to further investigate the foundations for novel SMT and SAT-based bounded model checking (BMC) algorithms for real-time and multi-agent systems. A major part of the research will involve the development of SMT-based BMC methods for standard Kripke structures, extended Kripke structures, and for different kinds of interpreted systems for different kinds of te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008